NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
111	Christmas Games by Ucaoimhu As you’ve probably heard, games parties at the North Pole have occasionally not been as inclusive as desired. Fortunately, that particular incident has not been repeated, and all of Santa’ Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2011-12-26 09:18:11 Puzzle video games Gaming Color Lines Games NP-complete problems Logic puzzles
112	TOCS9478_source.nohead.pdf Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-05-14 08:02:16 Graph theory NP-complete problems Circle graph Intersection graph Dominating set Interval graph Chordal graph Graph coloring Treewidth Claw-free graph Clique Planar graph
113	Output-Sensitive Construction of the Union of Triangles Esther Ezra and Micha Sharir School of Computer Science Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2007-08-27 22:45:23 Computational complexity theory Theory of computation Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Minimum spanning tree Point location
114	CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224 Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2012-03-26 04:52:47 Graph theory Mathematics Computational complexity theory NP-complete problems Hamiltonian path Eulerian path Travelling salesman problem Cycle Seven Bridges of Knigsberg Path NP-completeness Shortest path problem
115	The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Graph theory Mathematics NP-complete problems Combinatorial optimization Matching Vertex cover Gene
116	Spectral Graph Theory and Applications WSLecture 7: Hitting Time and Cover Time of Random Walks Lecturer: Thomas Sauerwald & He Sun Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2011-12-08 09:45:37 Graph theory Mathematics NP-complete problems Degree Algebraic graph theory Covering graph Line graph
117	CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-18 01:28:39 Graph theory Mathematics NP-complete problems Matroid theory Steiner tree problem Bipartite graph Eulerian path Graph Degree Ear decomposition Directed graph Cycle
118	MCS 401 – Computer Algorithms I Spring 2016 Problem Set 4 Lev Reyzin Due: by the beginning of class Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-03-11 11:13:37 Graph theory NP-complete problems Pathwidth Clique problem
119	Leveraging SMT: Using SMT Solvers to Improve Verification; Using Verification to Improve SMT Solvers Clark Barrett Christopher L. Conway Add to Reading List Source URL: fm.csl.sri.com Language: English - Date: 2010-10-30 16:21:50 Theoretical computer science Formal methods Logic in computer science Constraint programming Electronic design automation NP-complete problems Satisfiability modulo theories Solver SMT Uninterpreted function Model checking Alt-Ergo
120	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem

UPDATE